Finitely Convergent Cutting Plane Methods for Solving the Quadratic Assignment Problem
نویسندگان
چکیده
1
منابع مشابه
Box-inequalities for quadratic assignment polytopes
Linear Programming based lower bounds have been considered both for the general as well as for the symmetric quadratic assignment problem several times in the recent years. Their quality has turned out to be quite good in practice. Investigations of the polytopes underlying the corresponding integer linear programming formulations (the non-symmetric and the symmetric quadratic assignment polyto...
متن کاملADMM for the SDP relaxation of the QAP
4 The semidefinite programming SDP relaxation has proven to be extremely strong for many hard 5 discrete optimization problems. This is in particular true for the quadratic assignment problem QAP, 6 arguably one of the hardest NP-hard discrete optimization problems. There are several difficulties that 7 arise in efficiently solving the SDP relaxation, e.g., increased dimension; inefficiency of ...
متن کاملAn exact solution method for quadratic matching: The one-quadratic-term technique and generalisations
The quadratic matching problem (QMP) asks for a matching in a graph that optimises a quadratic objective in the edge variables. The QMP generalises the quadratic assignment problem as the latter can be seen as a perfect matching on a bipartite graph. In our approach, we strengthen the linearised IP-formulation by cutting planes that are derived from facets of the corresponding matching problem ...
متن کاملA new linearization method for quadratic assignment problems
The quadratic assignment problem (QAP) is one of the great challenges in combinatorial optimization. Linearization for QAP is to transform the quadratic objective function into a linear one. Numerous QAP linearizations have been proposed, most of which yield mixed integer linear programs (MILP). Kauffmann and Broeckx’s linearization (KBL) is the current smallest one in terms of the number of va...
متن کاملConditions ensuring the applicability of cutting-plane methods for solving variational inequalities
Let VIP(F; C) denote the variational inequality problem associated with the mapping F and the closed convex set C. In this paper we introduce weak conditions on the mapping F that allow the development of a convergent cutting-plane framework for solving VIP(F; C). In the process we introduce, in a natural way, new and useful notions of generalized monotonicity for which rst order characterizati...
متن کامل